A Model of Countable Nondeterminism in Guarded Type Theory
نویسندگان
چکیده
We show how to construct a logical relation for countable nondeterminism in a guarded type theory, corresponding to the internal logic of the topos Sh (ω1) of sheaves over ω1. In contrast to earlier work on abstract step-indexed models, we not only construct the logical relations in the guarded type theory, but also give an internal proof of the adequacy of the model with respect to standard contextual equivalence. To state and prove adequacy of the logical relation, we introduce a new propositional modality. In connection with this modality we show why it is necessary to work in the logic of Sh (ω1).
منابع مشابه
Step-Indexed Relational Reasoning for Countable Nondeterminism
Programming languages with countable nondeterministic choice are computationally interesting since countable nondeterminism arises when modeling fairness for concurrent systems. Because countable choice introduces non-continuous behaviour, it is well-known that developing semantic models for programming languages with countable nondeterminism is challenging. We present a step-indexed logical re...
متن کاملDiscrete Lawvere theories and computational effects
Countable Lawvere theories model computational effects such as exceptions, side-effects, interactive input/output, nondeterminism and probabilistic nondeterminism. The category of countable Lawvere theories has sums, tensors, and distributive tensors, modelling natural combinations of such effects. It is also closed under taking images. Enrichment in a category such as Cpo allows one to extend ...
متن کاملThe decidability of guarded fixed point logic
Guarded fixed point logics are obtained by adding least and greatest fixed points to the guarded fragments of first-order logic that were recently introduced by Andréka, van Benthem and Németi. Guarded fixed point logics can also be viewed as the natural common extensions of the modal μ-calculus and the guarded fragments. In a joint paper with Igor Walukiewicz, we proved recently that the satis...
متن کاملGeneric models for computational effects
AFreyd-category is a subtle generalisation of the notion of a categorywith finite products. It is suitable formodelling environments in call-by-value programming languages, such as the computational -calculus, with computational effects.We develop the theory of Freyd-categorieswith that inmind.Wefirst show that any countable Lawvere theory, hence any signature of operationswith countable arity ...
متن کاملDeveloping and Reasoning About Probabilistic Programs in pGCL
As explained in Chapter 1, Dijkstra’s guarded-command language, which we call GCL, was introduced as an intellectual framework for rigorous reasoning about imperative sequential programs; one of its novelties was that it contained explicit “demonic” nondeterminism, representing abstraction from (or ignorance of) which of two program fragments will be executed. By introducing probabilistic nonde...
متن کامل